Secret computation system, arithmetic unit, secret computation method and program

ABSTRACT

Each of at least three arithmetic units includes: a random number generator determining shared value [r] obtained by performing secret sharing of random number r; a randomizator using shared value [a 0 ], . . . ,[a M−1 ] obtained by performing secret sharing of value a 0 , . . . , a M−1  and shared value [r] to generate randomized shared value &lt;a 0 &gt;, . . . , &lt;a M−1 &gt; with shared values [a 0 ], . . . , [a M−1 ] and [a 0 r], . . . , [a M−1 r] as a pair; a secret computator determining concealed function value [F([a 0 ], . . . , [a M−1 ])] by executing function F including at least one secret operation while including randomized shared value &lt;f 1 &gt; of an operation target and an operation result depending on contents of secret operation into checksum C:=&lt;f 0 &gt;, . . . , &lt;f μ−1 &gt;; and a correctness prover verifying correctness of function value [F([a 0 ], . . . , [a M−1 ])] based on shared value [Ø] obtained by multiplying a sum total of shared values [f 1 ] included in checksum C by shared value [r] and shared value [ψ] of a sum total of shared values [f i r] included in checksum C.

TECHNICAL FIELD

The present invention relates to a secret computation technique, and in particular to a technique for performing computation while concealing data, and ensuring correctness of a computation result.

BACKGROUND ART

Conventionally, as a technique for performing computation including multiplication and addition while ensuring correctness of a computation result, in a state of concealing data, three-party secure function evaluation of Non-patent literature 1 exists. This is a protocol for bringing about a result of an arithmetic/logical operation by cooperative computation by three parties (three computation subjects) without restoring a shared input value. In the three-party secure function evaluation protocol, data is treated as a natural number smaller than a certain determined prime number p. When data is to be concealed, and the data is indicated by a, a is shared into three such that the following condition is satisfied.

a=a ₀ +a ₁ +a ₂ mod p

Actually, random number a₁ and a₂ are generated, and a₀=a−a₁−a₂ is obtained. Then, (a₀,a₁), (a₁,a₂) and (a₂,a₀) are transmitted to three parties X, Y and Z, respectively. Then, though none of X, Y and Z has information about a because a₁ and a₂ are random numbers, a can be restored if any two parties gather.

Since concealment is additive sharing, the same result is obtained irrespective of whether the shared values are restored after being added or added after being restored, due to commutativity of the concealment. That is, an addition and a constant multiplication can be performed without communication in a shared state. Further, a multiplication is also possible though communication and random number generation are required. Therefore, it is possible to configure a logical circuit and execute any computation. A specific example of the three-party secure function evaluation will be shown below. In the three-party secure function evaluation protocol, a computation result is a remainder of division by p. However, description of “mod p” will be omitted below for simplification of description.

(1) Restoration of Secret Data a Shared to X, Y and Z

X transmits a₀ to Y, and transmits a₁ to Z. Y transmits a₁ to Z, and transmits a₂ to X. Z transmits a₂ to X and transmits a₀ to Y.

If a₂ received from Y and a₂ received from Z correspond to each other, X computes a₀+a₁+a₂ to restore a. If a₀ received from X and a₀ received from Z correspond to each other, Y computes a₀+a₁+a₂ to restore a. If a₁ received from X and a₁ received from Y correspond to each other, Z computes a₀+a₁+a₂ to restore a.

(2) Secret Computation of c=a+b

It is assumed that data b is also concealed by (b₀,b₁), (b₁,b₂) and (b₂,b₀) being shared to X, Y and Z, respectively, in a method similar to the case of data a.

At this time, X computes and records (c₀,c₁)=(a₀+b₀,a₁+b₁), Y computes and records (c₁,c₂)=(a₁+b₁,a₂+b₂), and Z computes and records (c₂,c₀)=(a₂+b₂,a₀+b₀)

(3) Secret Computation of c=a+α (α: a Known Constant)

X computes and records (c₀,c₁)=(a₀+α,a₁), and Z computes and records (c₂,c₀)=(a₂,a₀+α). Y does not perform processing.

(4) Secret Computation of c=a*α

X computes and records (c₀,c₁)=(a₀*α,a₁*α), Y computes and records (c₁,c₂)=(a₁*α,a₂*α), and Z computes and records (c₂,c₀)=(a₂*α,a₀*α).

(5) Secret Computation of c=a*b (A Multiplication Without Detection of Illegality)

First, X generates random numbers r₁, r₂ and c₀, computes c₁=(a₀+a₁)(b₀+b₁)−r₁−r₂−c₀, and transmits (r₁,c₁) and (r₂,c₀) to Y and Z, respectively.

Next, Y computes y=a₁*b₂+b₁*a₂+r₁ and transmits y to Z. Further, Z computes z=a₂*b₀+b₀*a₂+r₂ and transmits z to Y.

Next, each of Y and Z computes c₂=y+z+a₂*b₂.

Then, X records (c₀,c₁), Y records (c₁,c₂), and Z records (c₂,c₀).

(6) Secret Computation of c=a*b (A Multiplication with Detection of Illegality)

After the multiplication of c=a*b is performed by the method of (5) above, the following process is performed for each of X, Y and Z. In the following process, P means each of X, Y and Z. If P is X, P⁻ and P₊ means Z and Y, respectively. If P is Y, P⁻ and P₊ means X and Z, respectively. If P is Z, P⁻ and P₊means Y and X, respectively.

First, only P⁻ and P₊ generate and share a random number r, and P⁻ and P₊ distribute r*a₀, r*a₁ and r*a₂ to the respective parties as secret values of r*a. Next, c′=(r*a)*b is computed by the method of (5) above. Then, it is checked whether r*c−c′ is 0 or not, illegality is detected if r*c−c′ is not 0.

PRIOR ART LITERATURE Non-Patent Literature

-   [Non-patent literature 1] Koji Chida, Koki Hamada, Dai Ikarashi and     Katsumi Takahashi, “A Three-Party Secure Function Evaluation with     Lightweight Verifiability Revisited”, CSS2010, 2010

SUMMARY OF THE INVENTION Problems to be Solved by the Invention

In conventional secret computation techniques for ensuring correctness of a computation result, there is a problem that it is not possible to select a security parameter. In the above conventional techniques, unit data targeted by computation is specified as a ring R, and the security parameter is uniquely specified by the ring R. For example, when R={0,1} is specified to compute a logical circuit, the security parameter is 2. In this case, it means that correctness of a computation result can be ensured only with a probability of 1/2.

An object of this invention is to provide a secret computation technique capable of arbitrarily setting a security parameter and lowering the probability of success in falsification.

Means to Solve the Problems

In order to solve the above problem, a secret computation system of this invention comprises at least three arithmetic units. In this invention, M, m and i are integers equal to or larger than 1; 0≦m<M is satisfied; μ is the number of randomized shared values included in a checksum C; and 0≦i<μ is satisfied.

The arithmetic unit comprises: a random number generating part determining a shared value [r] obtained by performing secret sharing of a random number r; a randomization part using a shared value [a₀], . . . , [a_(M−1)] obtained by performing secret sharing of a value a₀, . . . , a_(M−1) and the shared value [r] to compute a shared value [a₀r], . . . , [a_(M−1)r] of an integrated value a₀r, . . . , a_(M−1)r of the value a₀, . . . , a_(M−1) and the random number r and generate a randomized shared value <a₀>, . . . , <a_(M−1)> with the shared value [a₀], . . . , [a_(M−1)] and the shared value [a₀r], . . . , [a_(M−1)r] as a pair; a secret computation part determining a concealed function value [F([a₀], . . . , [a_(M−1)])] by executing a function F including at least one secret operation while including a randomized shared value <f_(i)> which is an operation target and an operation result depending on the contents of secret operation into the checksum C:=<f₀>, . . . , <f_(μ−1)>; and a correctness proving part verifying correctness of the function value [F([a₀], . . . , [a_(M−1)])] on the basis of a shared value [Ø] obtained by multiplying a sum total of shared values [f_(i)] included in the checksum C by the shared value [r] and a shared value [ψ] which is a sum total of shared values [f_(i)r] included in the checksum C.

Effects of the Invention

According to a secret computation technique of this invention, it is possible to perform secret computation under a lower probability of success in falsification than before. Further, efficiency of proving correctness has been improved more than before, and it is possible to detect falsification at a high speed.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a diagram illustrating a functional configuration of a secret computation system;

FIG. 2 is a diagram illustrating a functional configuration of an arithmetic unit;

FIG. 3 is a diagram illustrating a functional configuration of a secret computation part; and

FIG. 4 is a diagram illustrating a process flow of a secret computation method.

DETAILED DESCRIPTION OF THE EMBODIMENT

Prior to description of an embodiment, description will be made on a method of expression in this specification and a fundamental way of thinking of this invention.

<Method of Expression>

Values handled in this invention are assumed to be values on R unless otherwise stated. R is a ring. A is an associative algebra on R. The associative algebra is an associative ring and is provided with such a structure of a linear space on some field that is compatible therewith. The associative algebra can be said to be such that a value handled in a vector space may be not a field but a ring.

The i-th element of a vector X is referred to with X_(i) (subscript).

Here, [x] is a secret sentence of a value x∈R. A secret sentence is a value obtained by concealing a value by means such as encryption and secret sharing. If X is a set, [X] is a set in which each element of the set X is concealed.

Here, |X| is the number of elements of the set X.

Here, <x> is a randomized shared value of the value x∈R. A randomized shared value is a pair of the shared value [x] and a shared value [xr] of an integrated value xr of the value x and a random number r∈A. Therefore, the randomized shared value can be defined like the following Formula (1).

[Formula 1]

<x>:=([x],[xr])∈[R]×[A]  (1)

The 0-th component ([x] in Formula (1)) and the 1st component ([xr] in Formula (1)) of the randomized shared value are also referred to as an R component and an A component, respectively.

A space of a randomized shared value with the random number r ∈ A as a parameter is assumed to be <Rr>.

<Security>

In the technical field of theory of cryptograph, a user/participant and an attacker are modeled in order to prove security of a protocol. As such models, a malicious model and a semi-honest model are used. In the malicious model, an attacker performs an arbitrary illegal action. In the semi-honest model, processing performed by an attacker is legal, and the attacker attempts to stealthily look at data within the legality. Therefore, a protocol for which security is proved in the malicious model can be evaluated for a higher security.

The conventional secret computation technique described in Non-patent literature 1 is secure in the semi-honest model. In the malicious model, however, secrecy is not ensured though correctness of a computation result is ensured. This invention realizes secure secret computation in the malicious model with a higher security, using secret computation which is secure in the semi-honest model.

<Points of Invention>

In conventional secret computation techniques, correctness is proved by performing an operation on the ring R by four systems. In this invention, correctness is proved by two systems, an operation on the ring R and an operation on an associative algebra A.

In conventional secret computation, it is possible to efficiently perform processing only on the same ring R. In the case of an operation on the associative algebra A, however, it is possible to perform processing while keeping upper compatibility with elements of the ring R, with efficiency equal to that of an operation on the ring R. An extended field, which is an algebraic structure belonging to an associative algebra, is an ideal algebraic structure from the viewpoint of security because results of a multiplication by random numbers are uniformly distributed.

In this invention, a shared value on the ring R is caused to be a randomized shared value with the use of a random number on the associative algebra A, and correctness is provide by two systems, an operation on the ring R and an operation on the associative algebra A. Therefore, by setting the associative algebra A in an appropriate space, a security parameter can be arbitrarily set. Thus, it is possible to perform secret computation under a lower probability of success in falsification than before.

Embodiment

An embodiment of this invention will be described below in detail. In drawings, components having the same functions are given the same reference numbers, and overlapped description will be omitted.

<Configuration>

A configuration example of a secret computation system 1 of this embodiment will be described with reference to FIG. 1. The secret computation system 1 comprises N (N≧3) arithmetic units 2 ₁, . . . , 2 _(N). Each of the N arithmetic units 2 ₁, . . . , 2 _(N) is connected to a network 9. The network 9 only has to be configured such that each connected unit is mutually communicable and can be configured, for example, with the Internet, a LAN (Local Area Network), a WAN (Wide Area Network) or the like. Each unit is not necessarily required to be communicable on line via the network. For example, such a configuration may be made that information to be inputted to the arithmetic units 2 ₁, . . . , 2 _(N) is stored into a portable recording medium, such as a magnetic tape and a USB memory, and inputted from the portable recording medium to the arithmetic units 2 ₁, . . . , 2 _(N) off-line.

A configuration example of an arithmetic unit 2 _(n) (1≦n≦N) included in the secret computation system 1 will be described with reference to FIG. 2. The arithmetic unit 2 _(n) comprises a control part 101, a memory 102, an input part 11, a random number generating part 12, a randomization part 13, a secret computation part 14, a correctness proving part 15 and an output part 16. The arithmetic unit 2 _(n) is, for example, a special apparatus configured by a special program being read into a well-known or dedicated computer having a CPU (Central Processing Unit), a RAM (Random Access Memory) and the like. The arithmetic unit 2 _(n) executes each process under the control of the control part 101. Data inputted to the arithmetic unit 2 _(n) or data obtained by each process is stored into the memory 102, and the data stored into the memory 102 is read and used for other processes as necessary.

A configuration example of the secret computation part 14 included in the arithmetic unit 2 _(n) will be described with reference to FIG. 3. The secret computation part 14 comprises an addition/constant multiplication part 141, a multiplication part 142, a sum-of-products part 143 and a random permutation part 144. The secret computation part 14 controls each component to execute desired computation.

<Secret Computation Process>

An operation example of the secret computation system 1 of this embodiment will be described in detail in accordance with a procedure flow with reference to FIG. 4.

At least one shared value [a₀], . . . , [a_(M−1)] (M≧1) is inputted to the input part 11 which the arithmetic unit 2 _(n) (1≦n≦N) is provided with (step S11). The inputted shared value [a₀], . . . , [a_(M−1)] is outputted to the randomization part 13. A shared value [a_(m)] (0≦m<M) is a shared value obtained by performing secret sharing of a value a_(m). Though a method for the secret sharing is required to be a secret sharing system in which each operation of an addition, a multiplication, a sum of products and random permutation is possible in secret computation, any secret sharing scheme may be adopted if these operations are possible. See Non-patent literature 1 for details about an applicable secret sharing method. The number M of shared values [a₀], . . . , [a_(M−1)] to be inputted is decided appropriately on the basis of the contents of secret computation performed by the secret computation part 14.

The random number generating part 12 generates a shared value [r] of a random number r∈A selected from the associative algebra A. The generated shared value [r] is outputted to the randomization part 13. Generation of the shared value [r] must be performed in a state that the random number r is concealed from any of the arithmetic units 2 ₁, . . . , 2 _(N).

For example, the arithmetic units 2 ₁, . . . , 2 _(N) constituting the secret computation system 1 can generate the shared value [r] of the random number r in cooperation with one another. Specifically, each arithmetic unit 2 _(n) generates a random number r_(n) first. Next, a shared value [r_(n)] of the random number r_(n) is generated by the concealment method described in Non-patent literature 1. Then, each arithmetic unit 2 _(n) computes [r]=Σ_(n<N)[r_(n)] to obtain the shared value [r] of the random number r. If such a configuration is made, all the arithmetic units 2 ₁, . . . , 2 _(N) can obtain the shared value [r] of the random number r without knowing the random number r.

Further, if it is possible to permit prior random number sharing or use of a pseudorandom number, it is possible to generate the shared value [r] of the random number r using replicated secret sharing. If replicated secret sharing is used, it is possible to generate the shared value [r] of the random number r without communication among the arithmetic units 2 ₁, . . . , 2 _(N). See “R. Cramer, I. Damgard, and Y. Ishai, “Share conversion, pseudorandom secret-sharing and applications to secure computation”, TCC, Vol. 3378 of Lecture Notes in Computer Science, pp. 342-362, Springer, 2005 (Reference literature 1)” for details of replicated secret sharing.

The randomization part 13 generates a randomized shared value <a₀>, . . . , <a_(M−1)> using the shared value [a₀], . . . , [a_(M−1)] and the shared value [r] (step S13). The generated randomized shared value <a₀>, . . . , <a_(M−1)> is outputted to the secret computation part 14.

Specifically, for m=0, . . . , M−1, the randomization part 13 determines [a_(m)r]=[a_(m)]×[r] by the secret computation method described in Non-patent literature 1, using the shared value [a_(m)] and the shared value [r] and generates a randomized shared value <a_(m)>=([a_(m)],[a_(m)r]) with the shared value [a_(m)] and the shared value [a_(m)r] as a pair.

The secret computation part 14 executes a function F which includes at least one secret operation for the randomized shared value <a₀>, . . . , <a_(M−1)> to determine a concealed function value [F([a₀], . . . , [a_(M−1)])] (step S14). At this time, a randomized shared value <f_(i)> to be an operation target and an operation result depending on the contents of a secret operation is included into a checksum C:=<f₀>, . . . , <f_(μ−1)>. Here, μ indicates the number of randomized shared values to be included into the checksum C. The value of is incremented each time the checksum C is updated. The determined function value [F([a₀], . . . , [a_(M−1)])] and the checksum C are outputted to the correctness proving part 15.

In the case where secret computation for an addition/constant multiplication is performed in the function F, the secret computation part 14 performs the secret computation by the addition/constant multiplication part 141. Because a randomized shared value has additive homomorphism, the secret computation for an addition/constant multiplication can be executed without communicating with the other the arithmetic units 2 _(n), similarly to an addition for a shared value on the ring R.

Specifically, a randomized shared value <γa+b> is computed by the following Formula (2) on the assumption that each of randomized shared values <a> and <b> is any of the randomized shared values <a₀>, . . . , <a_(M−1)> or a randomized shared value outputted from each component included in the secret computation part 14, and γ is an arbitrary constant. If an R component [γa+b] of the randomized shared value <γa+b> as a computation result is included among the function values [F([a₀], . . . , [a_(M−1)])], the randomized shared value <γa+b> is included into the checksum C by Formula (3). As for secret computation for an addition/constant multiplication, since the secret computation can be realized by an operation inside an arithmetic unit, update of the checksum C by a randomized shared value before the operation is not performed.

[Formulas 2]

<γa+b>:=(γ[a]+[b],γ[ar]+[br])   (2)

C:=C∪<γa+b>   (3)

In the case of performing secret computation for a multiplication in the function F, the secret computation part 14 performs the secret computation by the multiplication part 142. The secret computation for a multiplication is realized by a multiplication on the ring R and a scalar multiplication.

Specifically, the checksum C is updated by the following Formula (4), and a randomized shared value <ab> is computed by Formula (5), on the assumption that each of the randomized shared values <a> and <b> is any of the randomized shared values <a₀>, . . . , <a_(M−1)> or a randomized shared value outputted from each component included in the secret computation part 14. If an R component [ab] of the randomized shared value <ab> as a computation result is included among the function values [F([a₀], . . . , [a_(M−1)])], the randomized shared value <ab> is included into the checksum C by Formula (6).

[Formulas 3]

C:=C∪{<a>,<b>}   (4)

<ab>:=([a][b],[a][br])   (5)

C:=C∪<ab>   (6)

In secret computation for a multiplication, [ar], which is an A component, is not used for the randomized shared value <a>. If [ar][br] are computed, [abr²] is obtained, and the degree of the random number r changes. In order to avoid this, [a][br]=[abr] is computed for the A component.

For a multiplication on the ring R, a method described in “R. Gennaro, M. O. Rabin, and T. Rabin, “Simplified VSS and fast-track multiparty computations with applications to threshold cryptography”, PODC, pp. 101-111, ACM, 1998 (Reference literature 2)” or “I. Damgard and J. B. Nielsen, “Scalable and unconditionally secure multiparty computation”, CRYPTO, Vol. 4622 of Lecture Notes in Computer Science, pp. 572-590, Springer, 2007 (Reference literature 3)” can be applied. When the total number of the arithmetic units 2 _(n) is indicated by n, and the number of arithmetic units 2 _(n) required for restoration is indicated by k, one round of traffic O(n²) is conducted in the method described in Reference literature 2, while three rounds of traffic O(n) are conducted in the method described in Reference literature 3. Therefore, the method described in Reference literature 2 is more excellent from the viewpoint of traffic. More accurately, however, the traffic is n(n−1) in the method described in Reference literature 2, and the traffic is n(n−1)/k+6(n−1) in the method described in Reference literature 3. Therefore, when n is small, there may be a case where the method described in Reference literature 2 is more efficient.

As for a multiplication on the associative algebra A, since A is a ring, a semi-honest multiplication can be performed without a problem if replicated secret sharing is used. Further, if A is a field, it does not matter even if Shamir's secret sharing is used. When A is not a field in the case of using Shamir's secret sharing, it is not obvious whether it does not matter. If A is merely R^(q), however, it is only necessary to perform a multiplication on R for each component.

A scalar multiplication is an operation for computing [ab]∈[A] from [a]∈[R], [b]∈[A]. If A is expressed as a q-dimensional vector of R′ relative to the ring homomorphism R′ of R, the scalar multiplication is easy. A homomorphism of R→R′ is indicated by h, and [b]=([b₀], . . . , [b_(q−1)]) is assumed. If [h(a)] is assumed to be obtained by causing h to act on each party's share of [a], [h(a)] belongs to [R′] because of the homomorphism. That is, [ab]:=([h(a)][b₀], . . . , [h(a)][b _(q−1)]) is obtained. Because h is a local computation, traffic corresponds to q multiplications on R′ (or one multiplication on A), and the number of rounds is one. The case of A being an extended field is the simplest case of satisfying this condition. In this case, h can be an identical map, and [ab]:=([a][b₀], . . . , [a][b_(q−1)]) is obtained.

In the case of performing secret computation for a sum of products in the function F, the secret computation part 14 performs the secret computation by the sum-of-products part 143. The secret computation for a sum of products is realized by a sum of products on the ring R and a scalar sum of products.

Specifically, the checksum C is updated by the following Formula (7), and a randomized shared value <Σ_(i<L)α_(i)β_(i)> is computed by Formula (8), on the assumption that L is an integer between 2 and M including 2 and M, and each of randomized shared values <α₀>, . . . , <α_(L−1)> and <β₀>, . . . , <β_(L−1)> is any of the randomized shared values <a₀>, . . . , <a_(M−1)> or a randomized shared value outputted from each component included in the secret computation part 14. If an R component [Σ_(i<L)α_(i)β_(i)] of the randomized shared value <Σ_(i<L)α_(i)β_(i)> as a computation result is included among the function values [F([a₀], . . . , [a_(M−1)])], the randomized shared value <Σ_(i<L)α_(i)β_(i)> is included into the checksum C by a Formula (9).

$\begin{matrix} \left\lbrack {{Formulas}\mspace{14mu} 4} \right\rbrack & \; \\ {C:={C\bigcup\left\{ {\langle\alpha_{i}\rangle} \right\}_{0 \leq i < L}\bigcup\left\{ {\langle\beta_{i}\rangle} \right\}_{0 \leq i < L}}} & (7) \\ {{\langle{\sum\limits_{i < L}\; {\alpha_{i}\beta_{i}}}\rangle}:=\left( {{\sum\limits_{i < L}\; {\left\lbrack \alpha_{i} \right\rbrack \left\lbrack \beta_{i} \right\rbrack}},{\sum\limits_{i < L}\; {\left\lbrack \alpha_{i} \right\rbrack \left\lbrack {\beta_{i}r} \right\rbrack}}} \right)} & (8) \\ {C:={C\bigcup{\langle{\sum\limits_{i < L}\; {\alpha_{i}\beta_{i}}}\rangle}}} & (9) \end{matrix}$

A sum of products on the ring R can be realized with the use of a multiplication on the ring R. Traffic of a sum of products on the ring R is the same as traffic of one multiplication on the ring R. A scalar sum of products can be realized with a scalar multiplication. Traffic of a scalar sum of products is the same as traffic of one scalar multiplication. It is because of a reason similar to that of the multiplication part 142 of avoiding change in the degree of the random number r that [α_(i)r], which is an A component, is not used for a randomized shared value <α_(i)>.

In the case of performing secret computation for random permutation in the function F, the secret computation part 14 performs the secret computation by the random permutation part 144. In random permutation for a randomized shared value, the same random permutation is performed for an R component and an A component of the randomized shared value.

Specifically, the checksum C is updated by the following Formula (10), and a randomized shared value <α_(π(i))> is computed by Formulas (11) and (12), on the assumption that L is an integer between 2 and M including 2 and M, each of <α₀>, . . . , <α_(L−1)> is any of the randomized shared values <a₀>, . . . , <a_(M−1)> or a randomized shared value outputted from each component included in the secret computation part 14, and π is a map to a set of integers equal to or larger than 0 and smaller than L. If an R component [α_(π(i))] of the randomized shared value <α_(π(i))> as a computation result is included among the function values [F([a₀], . . . , [a_(M−1)])], the randomized shared value <α_(π(i))> is included into the checksum C by Formula (13).

[Formulas 5]

C:=C∪{<α_(i)>}_(0≦i<L)   (10)

{([α_(π(i))])}_(0≦i<L),{([α_(π(i)) r])}_(0≦i<L)   (11)

{<α_(π(i))>}_(0≦i<L):={([α_(π(i))],[α_(π(i)) r])}_(0≦i<L)   (12)

C:=C ∪{<α_(π(i))>}_(0≦i<L)   (13)

#1 Compute . . .

A method described in “Koki Hamada, Dai Ikarashi, Koji Chida and Katsumi Takahashi, “A Random Permutation Protocol on Three-Party Secure Function Evaluation”, CSS2010, 2010 (Reference literature 4)” can be applied to the secret computation for random permutation.

The correctness proving part 15 proves correctness of the function value [F([a₀], . . . , [a_(M−1)])] by verifying the checksum C using the shared value [r] (step S15). If it is judged that falsification has not been made, as a result of verifying the checksum C, the function value [F([a₀], . . . , [a_(M−1)])] is outputted to the output part 16. If it is judged that falsification has been made, information showing that effect (for example, “⊥”) is outputted to the output part 16. The verification of the checksum C is performed on the basis of a shared value [Ø] obtained by multiplying the sum total of shared values [f₀], . . . , [f_(μ−1)] included in the checksum C by the shared value [r] and a shared value [ψ], which is the sum total of shared values [f₀r], . . . , [f_(μ−1)r] included in the checksum C.

Specifically, the correctness proving part 15 verifies the checksum C, for example, as shown below. First, shared values [ρ₀], . . . , [ρ_(μ−1)] of μ random numbers ρ₀, . . . , ρ_(μ−1) on the associative algebra A are generated. The generation of the shared values [ρ₀], . . . , [ρ_(μ−1)] must be performed in a state that the random numbers ρ₀, . . . , ρ_(μ−1) are concealed from any of the arithmetic unit 2 _(n). The generation of the shared values [ρ₀], . . . , [ρ_(μ−1)] can be performed in a method similar to that of the random number generating part 12.

Next, the shared value [Ø] is determined from the following Formula (14) with the use of the shared values [f₀], . . . , [f_(μ−1)], shared values [ρ₀], . . . , [ρ_(μ−1)] and shared value [r] included in the checksum C.

$\begin{matrix} \left\lbrack {{Formula}\mspace{14mu} 6} \right\rbrack & \; \\ {\lbrack\phi\rbrack:={\left( {\sum\limits_{i < \mu}\; {\left\lbrack f_{i} \right\rbrack \left\lbrack \rho_{i} \right\rbrack}} \right)\lbrack r\rbrack}} & (14) \end{matrix}$

Further, the shared value [ψ] is determined from the following Formula (15) with the use of the shared values [f₀r], . . . , [f_(μ−1)r] and shared values [ρ₀], . . . , [ρ_(μ−1)] included in the checksum C.

$\begin{matrix} \left\lbrack {{Formula}\mspace{14mu} 7} \right\rbrack & \; \\ {\lbrack\psi\rbrack:={\sum\limits_{i < \mu}\; {\left\lbrack {f_{i}r} \right\rbrack \left\lbrack \rho_{i} \right\rbrack}}} & (15) \end{matrix}$

Then, a shared value [δ]=[Ø]−[ψ] obtained by subtracting the shared value [ψ] from the shared value [Ø] is restored. As for a method for the restoration, a restoration operation of a secret sharing scheme corresponding to each shared value can be used. At this time, correctness is ensured by the malicious model. Specifically, complete correctness is ensured by all the arithmetic units 2 ₁, . . . , 2 _(N) mutually transmitting the shared value [δ] to the other arithmetic units and confirming consistency in the shared values. In this case, when the total number of the arithmetic units 2 _(n) is indicated by n, and the number of arithmetic units 2 _(n) required for restoration is indicated by k, the total traffic is n(n−1). At this time, if a stochastic method is used, it is possible to cause the total traffic to be n(k−1) when the amount of data of the shared values are large. There is a semi-honest operation which includes such restoration that does not ensure correctness, like the secret computation described in Reference literature 3 described above. However, if such restoration that does not ensure correctness is included as a component of secret computation, it does not effect security of the whole secret computation.

If the restored value δ is 0 in all the arithmetic units 2 ₁, . . . , 2 _(N), it is judged that falsification has not been made through the whole secret computation. If the restored value δ is not 0 in any of the arithmetic units 2 ₁, . . . , 2 _(N), it is judged that falsification has been made in the secret computation.

A fundamental way of thinking of proving correctness will be described. When attention is paid to each randomized shared value, verification of a checksum is to verify whether [f_(i)][r]−[f_(i)r]=0 is satisfied. Here, if the case where both of the shared value [f_(i)] and the shared value [f_(i)r] have been falsified to be [f_(i)+x] and [f_(i)r+y] is considered, a value obtained by verification is as shown by Formula (16).

[Formula 8]

[f _(i) +x][r]−[f _(i) r+y]=[xr−y]  (16)

An attacker has to cope with operating [f_(i)] and [f_(i)r] so that the value of xr−y becomes 0. However, since the attacker does not know the random number r∈A, the probability of being able to satisfy that is 1/|A|. In this embodiment, however, the probability of success in falsification of the whole is 2/|A| at the most because multiplication by the random numbers ρ₀, . . . , ρ_(μ−1) is performed.

The secret computation part 14 is not necessarily required to comprise all the addition/constant multiplication part 141, the multiplication part 142, the sum-of-products part 143 and the random permutation part 144. It is sufficient if each component corresponding to operations included in the function F to be executed is included without deficiency. For example, if the function F is for computing only constant multiplication and multiplication operations, the secret computation part 14 only has to comprise the addition/constant multiplication part 141 and the multiplication part 142.

[Variation]

The ring R and the associative algebra A can be expressed as Z/pZ where Z indicates an integer ring, and p indicates a prime number. By making such a configuration, it is possible to cause the probability of success in falsification to be about 2/p. Further, it is possible to reduce the amount of data to be communicated among the arithmetic units in a secret operation.

The ring R can be expressed as Z/pZ and the associative algebra A can be expressed as a q-dimensional extended field of the ring R, where Z indicates an integer ring, p indicates a prime number, and q indicates an integer equal to or larger than 1. By making such a configuration, it is possible to cause the probability of success in falsification to be about 2/p^(q). When p is small, such as the case of R={0,1}, the configuration is especially effective.

The ring R is expressed as Z/p^(n)Z and the associative algebra A can be expressed as Z/p^(m)Z where Z indicates an integer ring, p indicates a prime number, and n and m indicate integers. By making such a configuration, it is possible to cause the probability of success in falsification to be about 2/p^(q).

[Program and Recording Medium]

It goes without saying that this invention is not limited to the embodiment described above and can be appropriately modified within a range not departing from the spirit of this invention. The various processes described in the above embodiment are not only to be executed in a time series in accordance with the described order but may be executed in parallel or separately according to throughputs of apparatuses which are to execute the processes or as necessary.

Further, in the case of realizing the various processing functions in each apparatus described in the above embodiment by a computer, the processing contents of the functions to be provided for each apparatus are written by a program. Then, by executing the program on the computer, the various processing functions in each apparatus described above are realized on the computer.

The program in which the processing contents are written can be recorded in a computer-readable recording medium. As the computer-readable recording medium, any recording medium, for example, a magnetic recording device, an optical disk, a magneto-optical recording medium, a semiconductor memory or the like is possible.

Further, distribution of this program is performed, for example, by selling, transferring or lending a portable recording medium, such as a DVD and a CD-ROM, in which the program is recorded. Furthermore, such a configuration is also possible that this program is stored in a storage device of a server computer and caused to be distributed by transferring the program from the server computer to other computers via a network.

For example, a computer which executes such a program, first stores the program recorded in a portable recording medium or transferred from a server computer into its storage device once. Then, at the time of executing a process, this computer reads the program stored in its recording medium and executes a process in accordance with the read program. Further, as other forms of executing this program, the computer may read the program directly from the portable recording medium and execute the process in accordance with the program. Furthermore, each time a program is transferred to this computer from the server computer, the computer may successively execute a process in accordance with the received program. Further, such a configuration is also possible that the above process is executed by a so-called ASP (Application Service Provider) type service in which the program is not transferred from the server computer to this computer, and the processing functions are realized only by instructing execution of the program and acquiring a result. It is assumed that the program in this embodiment includes information which is to be provided for processing by an electronic computer and is equivalent to a program (such as data which is not direct commands to a computer but has a nature of specifying processing by the computer).

Though it is assumed, in this embodiment, that the present apparatus is configured by causing a predetermined program to be executed on a computer, at least a part of the processing contents may be realized by hardware. 

1. A secret computation system comprising at least three arithmetic units, wherein M, m and i are integers equal to or larger than 1; 0≦m<M is satisfied; μ is the number of randomized shared values included in a checksum C; and 0≦i<μ is satisfied; and the arithmetic unit comprises: a random number generating part determining a shared value [r] obtained by performing secret sharing of a random number r; a randomization part using a shared value [a₀], . . . , [a_(M−1)] obtained by performing secret sharing of a value a₀, . . . , a_(M−1) and the shared value [r] to compute a shared value [a₀r], . . . , [a_(M−1)r] of an integrated value a₀r, . . . , a_(M−1)r of the value a₀, . . . , a_(M−1) and the random number r and generate a randomized shared value <a₀>, . . . , <a_(M−1)> with the shared value [a₀], . . . , [a_(M−1)] and the shared value [a₀r], . . . , [a_(M−1)r] as a pair; a secret computation part determining a concealed function value [F([a₀], . . . , [a_(M−1)])] by executing a function F including at least one secret operation while including a randomized shared value <f_(i)> which is an operation target and an operation result depending on the contents of secret computation into the checksum C:=<f₀>, . . . , <f_(μ−1)>; and a correctness proving part verifying correctness of the function value [F([a₀], . . . , [a_(M−1)])] on the basis of a shared value [Ø] obtained by multiplying a sum total of shared values [f_(i)] included in the checksum C by the shared value [r] and a shared value [ψ] which is a sum total of shared values [f_(i)r] included in the checksum C.
 2. The secret computation system according to claim 1, wherein the secret computation part comprises: an addition/constant multiplication part computing a randomized shared value <γa+b>:=(γ[a]+[b],γ[ar]+[br]) and including the randomized shared value <γa+b> into the checksum C, wherein each of <a>:=([a],[ar]) and <b>:=([b],[br]) is any of the randomized shared values <a₀>, . . . , <a_(M−1)>, and γ is a constant.
 3. The secret computation system according to claim 1, wherein the secret computation part comprises: a multiplication part including <a> and <b> into the checksum C, computing a randomized shared value <ab>:=([a][b],[a][br]) and including the randomized shared value <ab> into the checksum C, wherein each of <a>:=([a],[ar]) and <b>:=([b],[br]) is any of the randomized shared values <a₀>, . . . , <a_(M−1)>.
 4. The secret computation system according to claim 1, wherein the secret computation part comprises: a sum-of-products part including <α₀>, . . . , <α_(L−1)> and <β₀>, . . . , <β_(L−1)> into the checksum C, computing a randomized shared value <Σ_(i<L)α_(i)β_(i)>:=(Σ_(i<L)[α_(i)][β_(i)],Σ_(i<L)[α_(i)][β_(i)r]) and including the randomized shared value <Σ_(i<L)α_(i)β_(i)> into the checksum C, wherein L is an integer between 2 and M including 2 and M, and each of <α₀>:=([α₀], [α₀r]), . . . , <α_(L−1)>:=([α_(L−1)], [α_(L−1)r]) and <β₀>:=([β₀], [β₀r]), . . . , <β_(L−1)>:=([β_(L−1)], [β_(L−1)r]) is any of the randomized shared value <a₀>, . . . , <a_(M−1)>.
 5. The secret computation system according to claim 1, wherein the secret computation part comprises: a random permutation part including <α₀>, . . . , <α_(L−1)> into the checksum C, computing a randomized shared value <α_(π(i))>:=([α_(π(i))],[α_(π(i))r]) and including the randomized shared value <α_(π(i))> into the checksum C, wherein L is an integer between 2 and M including 2 and M, each of <α₀>:=([α₀], [α₀r]), . . . , <α_(L−1)>:=([α_(L−1)], [α_(L−1)r]) is any of the randomized shared value <a₀>, . . . , <a_(M−1)>, and π is a map to a set of integers equal to or larger than 0 and smaller than L.
 6. An arithmetic unit wherein M, m and i are integers equal to or larger than 1; 0≦m<M is satisfied; μ is the number of elements included in a checksum C; and 0≦i<μ is satisfied; and the arithmetic unit comprises: a random number generating part determining a shared value [r] obtained by performing secret sharing of a random number r; a randomization part using a shared value [a₀], . . . , [a_(M−1)] obtained by performing secret sharing of a value a₀, . . . , a_(M−1) and the shared value [r] to compute a shared value [a₀r], . . . , [a_(M−1)r] of an integrated value a₀r, . . . , a_(M−1)r of the value a₀, . . . , a_(M−1) and the random number r and generate a randomized shared value <a₀>, . . . , <a_(M−1)> with the shared value [a₀], . . . , [a_(M−1)] and the shared value [a₀r], . . . , [a_(M−1)r] as a pair; a secret computation part determining a concealed function value [F([a₀], . . . , [a_(M−1)])] by executing a function F including at least one secret operation while including a randomized shared value <f_(i)> which is an operation target and an operation result depending on the contents of secret operation into the checksum C:=<f₀>, . . . , <f_(μ−1)>; and a correctness proving part verifying correctness of the function value [F([a₀], . . . , [a_(M−1)])] on the basis of a shared value [Ø] obtained by multiplying a sum total of shared values [f_(i)] included in the checksum C by the shared value [r] and a shared value [ψ] which is a sum total of shared values [f_(i)r] included in the checksum C.
 7. A secret computation method wherein M, m and i are integers equal to or larger than 1; 0≦m<M is satisfied; μ is the number of elements included in a checksum C; and 0≦i<μ is satisfied; and the method comprises: a random number generating step of a random number generating part determining a shared value [r] obtained by performing secret sharing of a random number r; a randomization step of a randomization part using a shared value [a₀], . . . , [a_(M−1)] obtained by performing secret sharing of a value a₀, . . . , a_(M−1) and the shared value [r] to compute a shared value [a₀r], . . . , [a_(M−1)r] of an integrated value a₀r, . . . , a_(M−1)r of the value a₀, . . . , a_(M−1) and the random number r and generate a randomized shared value <a₀>, . . . , <a_(M−1)> with the shared value [a₀], . . . , [a_(M−1)] and the shared value [a₀r], . . . , [a_(M−1)r] as a pair; a secret computation step of a secret computation part determining a concealed function value [F([a₀], . . . , [a_(M−1)])] by executing a function F including at least one secret operation while including a randomized shared value <f_(i)> which is an operation target and an operation result depending on the contents of secret operation into the checksum C:=<f₀>, . . . , <f_(μ−1)>; and a correctness proving step of a correctness proving part verifying correctness of the function value [F([a₀], . . . , [a_(M−1)])] on the basis of a shared value [Ø] obtained by multiplying a sum total of shared values [f_(i)] included in the checksum C by the shared value [r] and a shared value [ψ] which is a sum total of shared values [f_(i)r] included in the checksum C.
 8. A non-transitory computer readable medium including computer executable instructions that make a computer function as the arithmetic unit according to claim
 6. 